Subset Synchronization of Transitive Automata
نویسندگان
چکیده
منابع مشابه
Subset Synchronization of Transitive Automata
We consider the following generalized notion of synchronization: A word is called a reset word of a subset of states of a deterministic finite automaton if it maps all states of the set to a unique state. It is known that the minimum length of such words is superpolynomial in worst cases, namely in a series of substantially nontransitive automata. We present a series of transitive binary automa...
متن کاملSubset Synchronization in Monotonic Automata
We study extremal and algorithmic questions of subset synchronization in monotonic automata. We show that several synchronization problems that are hard in general automata can be solved in polynomial time in monotonic automata, even without knowing a linear order of the states preserved by the transitions. We provide asymptotically tight lower and upper bounds on the maximum length of a shorte...
متن کاملThe Synchronization Problem for Strongly Transitive Automata
The synchronization problem for a deterministic n-state automaton consists in the search of an input-sequence, called a synchronizing word such that the state attained by the automaton, when this sequence is read, does not depend on the initial state of the automaton itself. If such a sequence exists, the automaton is called synchronizing. If the automaton is deterministic and complete, a well-...
متن کاملSubset Synchronization and Careful Synchronization of Binary Finite Automata
We consider the following generalized notion of synchronization: A word is called a reset word of a subset of states of a deterministic finite automaton if it maps all states of the set to a unique state. It is known that the minimum length of such words is superpolynomial in worst cases, namely in a series of substantially nontransitive automata. We present a series of transitive binary automa...
متن کاملSynchronization of Regular Automata
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consider the class of languages recognized by automata generated by all its synchronized grammars. The synchronization is an automaton-related notion: all grammars generating the same automaton synchronize the same languages...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.151.26